Factoring Integers Using SIMD Sieves
نویسندگان
چکیده
We describe our single-instruction multiple data (SIMD) implementation of the multiple polynomial quadratic sieve integer factoring algorithm. On a 16K MasPar massively parallel computer, our implementation can factor 100 digit integers in a few days. Its most notable success was the factorization of the 110-digit RSA-challenge number, which took about a month.
منابع مشابه
Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
Many cryptographic protocols derive their security from the apparent computational intractability of the integer factorization problem. Currently, the best known integer-factoring algorithms run in subexponential time. Efficient parallel implementations of these algorithms constitute an important area of practical research. Most reported implementations use multi-core and/or distributed paralle...
متن کاملFactoring Integers Using the Web
This note provides background on the www-factoring project, which was started in the fall of 1995. Factoring a positive integer ri means finding two positive integers u and v such that the product of u and v equals ri, and such that both u a.nd v are greater than 1. Such u and v are called factors (or divisors) of ii, and n = u v is called a factorization of n. Positive integers that ca.n be fa...
متن کاملSIMD Compression and the Intersection of Sorted Integers
Sorted lists of integers are commonly used in inverted indexes and database systems. They are often compressed in memory. We can use the SIMD instructions available in common processors to boost the speed of integer compression schemes. Our S4-BP128-D4 scheme uses as little as 0.7 CPU cycles per decoded 32-bit integer while still providing state-of-the-art compression. However, if the subsequen...
متن کاملSIMD-Based Implementations of Sieving in Integer-Factoring Algorithms
The best known integer-factoring algorithms consist of two stages: the sieving stage and the linear-algebra stage. Efficient parallel implementations of both these stages have been reported in the literature. All these implementations are based on multi-core or distributed parallelization. In this paper, we experimentally demonstrate that SIMD instructions available in many modern processors ca...
متن کاملA heuristic search based factoring tool
Factoring is believed to be a diflcult task. Although factoring is of interest in its own right, the security of RSA cryptography, among other cryptographic systems, is dependent on the diflculty of factoring the product of two large primes. We show how to cast the problem of factoring integers as a state-based search to which the techniques of AI may be applied. Using small primes as operators...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993